Geographical queries reformulation using a parallel association rules generator to build spatial taxonomies
نویسندگان
چکیده
Geographical queries need a special process of reformulation by information retrieval systems (IRS) due to their specificities and hierarchical structure. This fact is ignored most web search engines. In this paper, we propose an automatic approach for building spatial taxonomy, that models’ the notion adjacency will be used in part geographical query. exploits documents are top retrieved list when submitting entity, which composed relation noun city. Then, transactional database constructed, considering each document extracted as transaction contains nouns cities sharing country submitted query’s The algorithm frequent pattern growth (FP-growth) applied his parallel version (parallel FP-growth: PFP) order generate association rules, form country’s taxonomy Big Data context. Experiments has been conducted on Spark results show query using constructed based our proposed improves precision effectiveness IRS.
منابع مشابه
Using Association Rules for Query Reformulation
In this paper the authors will present research on the combination of two methods of data mining: text classification and maximal association rules. Text classification has been the focus of interest of many researchers for a long time. However, the results take the form of lists of words (classes) that people often do not know what to do with. The use of maximal association rules induced a num...
متن کاملUsing Taxonomies to Facilitate the Analysis of the Association Rules
The Data Mining process enables the end users to analyse, understand and use the extracted knowledge in an intelligent system or to support in the decision-making processes. However, many algorithms used in the process encounter large quantities of patterns, complicating the analysis of the patterns. This fact occurs with association rules, a Data Mining technique that tries to identify intrins...
متن کاملUsing Association Rules to Discover Search Engines Related Queries
This work presents a method for automatic generate suggestions of related queries submitted to Web search engines. The method extracts information from the log of past submitted queries to search engines using algorithms for mining association rules. Experimental results were performed on a log containing more than 2.3 million queries submitted to a commercial searching engine giving correct su...
متن کاملUsing Parallel Spatial Mashup Model to Process k-NN Queries
In this paper, we focus on k-NN queries where the distance between two locations is measured in terms of travel time. Generally speaking, it is costly for an LBS provider to collect real-time traffic data from vehicles or roadside sensors to compute the travel time and route information between two locations. Thus, we design a server-side spatial mashup model that enables an LBS provider to eff...
متن کاملUsing Actors to Build a Parallel DBMS
In this paper, we present the design and the architecture of a parallel main memory database management system. We focus on concurrency control scheme and recovery. Our prototype is based on the concept of “database actors”, an object-oriented data model well suited for parallel manipulations. The storage sub system is built upon distributed Ram-files using SDDS (Scalable Distributed Data Struc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electrical and Computer Engineering
سال: 2021
ISSN: ['2088-8708']
DOI: https://doi.org/10.11591/ijece.v11i3.pp2586-2594